Faster Algorithm for Mean-Payoff Games
نویسندگان
چکیده
We study some existing techniques for solving mean-payoff games (MPGs), improve them, and design a randomized algorithm for solving MPGs with currently the best expected complexity.
منابع مشابه
Faster O(|V|^2|E|W)-Time Energy Algorithms for Optimal Strategy Synthesis in Mean Payoff Games
This study strengthens the links between Mean Payoff Games (MPGs) and Energy Games (EGs). Firstly, we offer a faster O(|V |2|E|W ) pseudo-polynomial time and Θ(|V |+ |E|) space deterministic algorithm for solving the Value Problem and Optimal Strategy Synthesis in MPGs. This improves the best previously known estimates on the pseudo-polynomial time complexity to:
متن کاملFaster algorithms for mean-payoff games
In this paper, we study algorithmic problems for quantitative models that are motivated by the applications in modeling embedded systems. We consider two-player games played on a weighted graph with mean-payoff objective and with energy constraints. We present a new pseudopolynomial algorithm for solving such games, improving the best known worst-case complexity for pseudopolynomial mean-payoff...
متن کاملFaster Algorithms for Mean-Payoff Parity Games
Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a meanpayoff condition). Ther...
متن کاملA pseudo-quasi-polynomial algorithm for solving mean-payoff parity games
In a mean-payoff parity game, one of the two players aims both to achieve a qualitative parity objective and to minimize a quantitative long-term average of payoffs (aka. mean payoff). The game is zero-sum and hence the aim of the other player is to either foil the parity objective or to maximize the mean payoff. Our main technical result is a pseudo-quasi-polynomial algorithm for solving mean-...
متن کاملFast Algorithms for Monotonic Discounted Linear Programs with Two Variables per Inequality∗
We suggest new strongly polynomial algorithms for solving linear programs min( ∑ xi|S) with constraints S of the monotonic discounted form xi ≥ λxj + β with 0 < λ < 1. The algorithm for the case when the discounting factor λ is equal for all constraints is O(mn2), whereas the algorithm for the case when λ may vary between the constraints is O(mn2 logm), where n is the number of variables and m ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009